Neuroplasticity in Young Age: Computer-Based Early Neurodevelopment Classifier

Neurodevelopmental syndromes, a continuously growing issue, are impairments in the growth and development of the brain and CNS which are pronounced in a variety of emotional, cognitive, motor and social skills. Early assessment and detection of typical, clinically correlated early signs of developmental abnormalities is crucial for early and effective intervention, supporting initiation of early treatment and minimizing neurological and functional deficits. Successful early interventions would then direct to early time windows of higher neural plasticity. Various syndromes are reflected in early vocal and motor characteristics, making them suitable indicators of an infant’s neural development. Performance of the computerized classifiers we developed shows approximately 90% accuracy on a database of diagnosed babies. The results demonstrate the potential of vocal and motor analysis for computer-assisted early detection of neurodevelopmental insults

Macular Hole Surgery with Internal Limiting Membrane Peeling Facilitated by Membrane-Blue® versus Membrane-Blue-Dual®: A Retrospective Comparative Study

Background. This study aims to compare the outcome of macular hole (MH) surgery with internal limiting membrane (ILM) peeling facilitated by two different vital dyes. Methods. This was a retrospective chart review. The group designated “group-MB” underwent pars plana vitrectomy with ILM peeling facilitated by Membrane-Blue (MB), whereas in “group-MBD,” the vital dye used was Membrane-Blue-Dual (MBD). Results. Seventy-four eyes comprised the study population: 53 in group-MB and 21 in group-MBD. There was no difference in the rate of macular hole closure in group-MB or group-MBD: 71.2% closed MHs compared to 66.7%, respectively (p=0.7). Postoperative visual improvement was of a higher magnitude in the MBD group compared to the MB group: −0.34±0.81 logMAR versus 0.01±0.06 logMAR, respectively (p=0.003). Conclusions. In this study, MBD led to better visual results that may be related to better staining characteristics or lesser toxicity compared to MB

A global analysis of the impact of COVID-19 stay-at-home restrictions on crime

The implementation of COVID-19 stay-at-home policies was associated with a considerable drop in urban crime in 27 cities across 23 countries. More stringent restrictions over movement in public space were predictive of larger declines in crime. The stay-at-home restrictions to control the spread of COVID-19 led to unparalleled sudden change in daily life, but it is unclear how they affected urban crime globally. We collected data on daily counts of crime in 27 cities across 23 countries in the Americas, Europe, the Middle East and Asia. We conducted interrupted time series analyses to assess the impact of stay-at-home restrictions on different types of crime in each city. Our findings show that the stay-at-home policies were associated with a considerable drop in urban crime, but with substantial variation across cities and types of crime. Meta-regression results showed that more stringent restrictions over movement in public space were predictive of larger declines in crime.Peer reviewe

Multi-Collision Resistance: A Paradigm for Keyless Hash Functions

We introduce a new notion of multi-collision resistance for keyless hash functions. This is a natural relaxation of collision resistance where it is hard to find multiple inputs with the same hash in the following sense. The number of colliding inputs that a polynomial-time non-uniform adversary can find is not much larger than its advice. We discuss potential candidates for this notion and study its applications. Assuming the existence of such hash functions, we resolve the long-standing question of the round complexity of zero knowledge protocols --- we construct a 3-message zero knowledge argument against arbitrary polynomial-size non-uniform adversaries. We also improve the round complexity in several other central applications, including a 3-message succinct argument of knowledge for NP, a 4-message zero-knowledge proof, and a 5-message public-coin zero-knowledge argument. Our techniques can also be applied in the keyed setting, where we match the round complexity of known protocols while relaxing the underlying assumption from collision-resistance to keyed multi-collision resistance. The core technical contribution behind our results is a domain extension transformation from multi-collision-resistant hash functions for a fixed input length to ones with an arbitrary input length and a local opening property. The transformation is based on a combination of classical domain extension techniques, together with new information-theoretic tools. In particular, we define and construct a new variant of list-recoverable codes, which may be of independent interest

On Generic Constructions of Circularly-Secure, Leakage-Resilient Public-Key Encryption Schemes

Abstract. We propose generic constructions of public-key encryption schemes, satisfying key- dependent message (KDM) security for projections and different forms of key-leakage resilience, from CPA-secure private key encryption schemes with two main abstract properties: (1) additive homomorphism with respect to both messages and randomness, and (2) reproducibility, providing a means for reusing encryption randomness across independent secret keys. More precisely, our construction transforms a private-key scheme with the stated properties (and one more mild condition) into a public-key one, providing: - n-KDM-projection security, an extension of circular security, where the adversary may also ask for encryptions of negated secret key bits; – a (1-o(1)) resilience rate in the bounded-memory leakage model of Akavia et al. (TCC 2009); and – Auxiliary-input security against subexponentially-hard functions. We introduce homomorphic weak pseudorandom functions, a homomorphic version of the weak PRFs proposed by Naor and Reingold (FOCS ’95) and use them to realize our base encryption scheme. We obtain homomorphic weak PRFs under assumptions including subgroup indistinguishability (implied, in particular, by QR and DCR) and homomorphic hash-proof systems (HHPS). As corollaries of our results, we obtain (1) a projection-secure encryption scheme (as well as a scheme with a (1-o(1)) resilience rate) based solely on the HHPS assumption, and (2) a unifying approach explaining the results of Boneh et al (CRYPTO ’08) and Brakerski and Goldwasser (CRYPTO ’10). Finally, by observing that Applebaum’s KDM amplification method (EUROCRYPT ’11) preserves both types of leakage resilience, we obtain schemes providing at the same time high leakage resilience and KDM security against any fixed polynomial-sized circuit family

Identification of Widespread Ultra-Edited Human RNAs

Adenosine-to-inosine modification of RNA molecules (A-to-I RNA editing) is an important mechanism that increases transciptome diversity. It occurs when a genomically encoded adenosine (A) is converted to an inosine (I) by ADAR proteins. Sequencing reactions read inosine as guanosine (G); therefore, current methods to detect A-to-I editing sites align RNA sequences to their corresponding DNA regions and identify A-to-G mismatches. However, such methods perform poorly on RNAs that underwent extensive editing (“ultra”-editing), as the large number of mismatches obscures the genomic origin of these RNAs. Therefore, only a few anecdotal ultra-edited RNAs have been discovered so far. Here we introduce and apply a novel computational method to identify ultra-edited RNAs. We detected 760 ESTs containing 15,646 editing sites (more than 20 sites per EST, on average), of which 13,668 are novel. Ultra-edited RNAs exhibit the known sequence motif of ADARs and tend to localize in sense strand Alu elements. Compared to sites of mild editing, ultra-editing occurs primarily in Alu-rich regions, where potential base pairing with neighboring, inverted Alus creates particularly long double-stranded RNA structures. Ultra-editing sites are underrepresented in old Alu subfamilies, tend to be non-conserved, and avoid exons, suggesting that ultra-editing is usually deleterious. A possible biological function of ultra-editing could be mediated by non-canonical splicing and cleavage of the RNA near the editing sites